-
1 eigenvalue algorithm
-
2 eigenvalue algorithm
English-russian dictionary of physics > eigenvalue algorithm
-
3 eigenvalue algorithm
Англо-русский словарь промышленной и научной лексики > eigenvalue algorithm
-
4 алгоритм вычисления собственных значений
Русско-английский физический словарь > алгоритм вычисления собственных значений
-
5 алгоритм вычисления собственных значений
Makarov: eigenvalue algorithmУниверсальный русско-английский словарь > алгоритм вычисления собственных значений
-
6 Обусловлен плохо (хорошо)
In other words, if $lambda$ is near (far from) another eigenvalue of $A$, then its eigenvector will be ill (possibly well) conditionedIt should not be thought that the only ill-conditioned eigenvectors are those corresponding to poorly separated eigenvaluesSome insight into the meaning of the definition of stability can be gained by considering what happens when a stable algorithm is used to solve a well-conditioned problemРусско-английский словарь по прикладной математике и механике > Обусловлен плохо (хорошо)
-
7 Обусловлен плохо (хорошо)
In other words, if $lambda$ is near (far from) another eigenvalue of $A$, then its eigenvector will be ill (possibly well) conditionedIt should not be thought that the only ill-conditioned eigenvectors are those corresponding to poorly separated eigenvaluesSome insight into the meaning of the definition of stability can be gained by considering what happens when a stable algorithm is used to solve a well-conditioned problemРусско-английский словарь по прикладной математике и механике > Обусловлен плохо (хорошо)
См. также в других словарях:
Eigenvalue algorithm — In linear algebra, one of the most important problems is designing efficient and stable algorithms for finding the eigenvalues of a matrix. These eigenvalue algorithms may also find eigenvectors. Contents 1 Characteristic polynomial 2 Power… … Wikipedia
Jacobi eigenvalue algorithm — The Jacobi eigenvalue algorithm is a numerical procedure for the calculation of all eigenvalues and eigenvectors of a real symmetric matrix. Description Let varphi in mathbb{R}, , 1 le k < l le n and let J(varphi, k, l) denote the n imes n matrix … Wikipedia
Divide-and-conquer eigenvalue algorithm — Divide and conquer eigenvalue algorithms are a class of eigenvalue algorithms for Hermitian or real symmetric matrices that have recently (circa 1990s) become competitive in terms of stability and efficiency with more traditional algorithms such… … Wikipedia
Eigenvalue, eigenvector and eigenspace — In mathematics, given a linear transformation, an Audio|De eigenvector.ogg|eigenvector of that linear transformation is a nonzero vector which, when that transformation is applied to it, changes in length, but not direction. For each eigenvector… … Wikipedia
QR algorithm — In numerical linear algebra, the QR algorithm is an eigenvalue algorithm; that is, a procedure to calculate the eigenvalues and eigenvectors of a matrix. The QR transformation was developed in 1961 by John G.F. Francis (England) and by Vera N.… … Wikipedia
Root-finding algorithm — A root finding algorithm is a numerical method, or algorithm, for finding a value x such that f(x) = 0, for a given function f. Such an x is called a root of the function f. This article is concerned with finding scalar, real or complex roots,… … Wikipedia
Lanczos algorithm — The Lanczos algorithm is an iterative algorithm invented by Cornelius Lanczos that is an adaptation of power methods to find eigenvalues and eigenvectors of a square matrix or the singular value decomposition of a rectangular matrix. It is… … Wikipedia
Grover's algorithm — is a quantum algorithm for searching an unsorted database with N entries in O(N1/2) time and using O( log N) storage space (see big O notation). It was invented by Lov Grover in 1996.Classically, searching an unsorted database requires a linear… … Wikipedia
Block Lanczos algorithm for nullspace of a matrix over a finite field — The Block Lanczos algorithm for nullspace of a matrix over a finite field is a procedure for finding the nullspace of a matrix using only multiplication of the matrix by long, thin matrices. These long, thin matrices are considered as vectors of… … Wikipedia
Eigenvalues and eigenvectors — For more specific information regarding the eigenvalues and eigenvectors of matrices, see Eigendecomposition of a matrix. In this shear mapping the red arrow changes direction but the blue arrow does not. Therefore the blue arrow is an… … Wikipedia
Singular value decomposition — Visualization of the SVD of a 2 dimensional, real shearing matrix M. First, we see the unit disc in blue together with the two canonical unit vectors. We then see the action of M, which distorts the disk to an ellipse. The SVD decomposes M into… … Wikipedia